Distributed Commuting Augmented Shortest Path Finding for Geo Spatial Datasets
نویسندگان
چکیده
Geo Spatial information is a large collection of datasets referring to the real world entities. Geo Spatial information has evolved in the last decade which led to produce a vast platform in Government Administration, Scientific Analysis and other various sectors especially in disaster management (DM), site suitability of Check-dams for Irrigation Department etc. It is required to obtain imperative geographically analyzed solutions like finding shortest path between sources (i.e. location having stock of food packets, clinical remedial and therapeutic kits, etc.) to the destination (i.e. location where disaster emerges). Departmental data (i.e. village Maps) covers detailed spatial and attribute information compared to the readily available sources. Hence custom solutions based on Information Technology are required to be constructed, processed efficiently and quickly to outfit seamless performance that facilitates in mission critical incidences.
منابع مشابه
Reliable shortest path finding in stochastic networks with spatial correlated link travel times
Reliable shortest path finding in stochastic networks with spatial correlated link travel times Bi Yu Chen a b , William H.K. Lam a , Agachai Sumalee a & Zhi-lin Li c a Department of Civil and Structural Engineering, The Hong Kong Polytechnic University, Hong Kong, PR China b State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan, PR Ch...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملA Distributed Shortest Path Algorithm for a Planar Network
An algorithm is presemed for finding a single source shortest path tree in a planar undirected distributed network with nonnegative edge COSlS. The number of messages used by the algorithm is 0 (n 513) on an n-node network.' Distributed algorithms are also presemed for finding a breadth-first spanning tree in a general network, for finding a shortest path tree in a general network, for finding ...
متن کاملKnowledge-Enriched Route Computation
Directions and paths, as commonly provided by navigation systems, are usually derived considering absolute metrics, e.g., finding the shortest or the fastest path within an underlying road network. With the aid of Volunteered Geographic Information (VGI), i.e., geo-spatial information contained in user generated content, we aim at obtaining paths that do not only minimize distance but also lead...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012